On regular parallelisms in PG(3,q)

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A note on Clifford parallelisms in characteristic two

It is well known that a purely inseparable field extension L/F with some extra property and degree [L : F] = 4 determines a Clifford parallelism on the set of lines of the three-dimensional projective space over F. By extending the ground field of this space from F to L, we establish the following geometric description of such a parallelism in terms of a distinguished ‘absolute pencil of lines’...

متن کامل

On Point-cyclic Parallelisms of Pg(3, 7)

A spread of lines is a set of lines of P G(n, q), which partition the point set. A parallelism is a partition of the set of lines by spreads. A parallelism in P G(n, q) is point-cyclic if it has an automorphism group which acts as a Singer automorphism. In P G(3, 7) no point-cyclic parallelisms have been known. We claim that such do not exist. 1. Introduction. Parallelisms of projective spaces ...

متن کامل

Partial k-Parallelisms in Finite Projective Spaces

In this paper, we consider the following question. What is the maximum number of pairwise disjoint k-spreads that exist in PG(n, q)? We prove that if k + 1 divides n + 1 and n > k then there exist at least two disjoint k-spreads in PG(n, q) and there exist at least 2k+1 − 1 pairwise disjoint k-spreads in PG(n, 2). We also extend the known results on parallelism in a projective geometry from whi...

متن کامل

Some new classes of finite parallelisms

Some new constructions of parallelisms in PG(3, q) are given that produce parallelisms consisting of one Desarguesian spread and q + q derived Knuth semifield spreads and other types consisting of one Knuth semifield spread, one Hall spread and the remaining spreads are derived Knuth semifield spreads.

متن کامل

Multicolored parallelisms of Hamiltonian cycles

A subgraph in an edge-colored graph is multicolored if all its edges receive distinct colors. In this paper, we prove that a complete graph on 2m + 1 vertices K2m+1 can be properly edge-colored with 2m+ 1 colors in such a way that the edges of K2m+1 can be partitioned intommulticolored Hamiltonian cycles. © 2009 Published by Elsevier B.V.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1984

ISSN: 0012-365X

DOI: 10.1016/0012-365x(84)90003-7